Context Uni cation and Traversal Equations
نویسندگان
چکیده
Context uniication was originally deened by H. Comon in ICALP'92, as the problem of nding a uniier for a set of equations containing rst-order variables and context variables. These context variables have arguments, and can be instantiated by contexts. In other words, they are second-order variables that are restricted to be instantiated by linear terms (a linear term is a-expression x1 xn : t where every xi occur exactly once in t). In this paper, we prove that, if the so called rank-bounded conjecture is true, then the context uniication problem is decidable. This is done reducing context uniication to solvability of traversal equations (a kind of word uniication modulo certain permutations) and then, reducing traversal equations to word equations with regular constraints.
منابع مشابه
A Universal Unification Algorithm Based on Unification-Driven Leftmost Outermost Narrowing
We formalize a universal uni cation algorithm for the class of equational theories which is induced by the class of canonical totally de ned not strictly subuni able term rewriting systems for short ctn trs For a ctn trs R and for two terms t and s the algorithm computes a ground complete set of ER uni ers of t and s where ER is the set of rewrite rules of R viewed as equations The algorithm is...
متن کاملHigh-Performance Multi-Pass Unication Parsing
Parsing natural language is an attempt to discover some structure in a text (or textual representation) generated by a person. This structure can be put to a variety of uses, including machine translation, grammar conformance checking, and determination of prosody in text-to-speech tasks. Recent theories of Syntax use Unication to better describe the intricacies of natural language [137]. For ...
متن کاملMatching and Uni cation in Rewrite Theories
\Semantic uni cation" is the process of generating a basis set of substitutions (of terms for variables) that makes two given terms equal in a speci ed theory. Semantic uni cation is an important component of some theorem provers. \Semantic matching," a simpler variant of uni cation, where the substitution is made in only one of the terms, has potential usage in programming language interpreter...
متن کاملMonadic Simultaneous Rigid E-Uni cation and Related Problems
We study the monadic case of a decision problem know as simultaneous rigid E-uni cation. We show its equivalence to an extension of word equations. We prove decidability and complexity results for special cases of this problem.
متن کاملContext Unification and Traversal Equations
Context unification was originally defined by H. Comon in ICALP’92, as the problem of finding a unifier for a set of equations containing first-order variables and context variables. These context variables have arguments, and can be instantiated by contexts. In other words, they are second-order variables that are restricted to be instantiated by linear terms (a linear term is a λ-expression λ...
متن کامل